Oracle-polynomial-time approximation of largest simplices in convex bodies
نویسندگان
چکیده
منابع مشابه
Approximation of convex bodies by inscribed simplices of maximum volume
The Banach-Mazur distance between an arbitrary convex body and a simplex in Euclidean n-space En is at most n+2. We obtain this estimate as an immediate consequence of our theorem which says that for an arbitrary convex body C in En and for any simplex S of maximum volume contained in C the homothetical copy of S with ratio n + 2 and center in the barycenter of S contains C . In general, this r...
متن کاملA polynomial oracle-time algorithm for convex integer minimization
In this paper we consider the solution of certain convex integer minimization problems via greedy augmentation procedures. We show that a greedy augmentation procedure that employs only directions from certain Graver bases needs only polynomially many augmentation steps to solve the given problem. We extend these results to convex N-fold integer minimization problems and to convex 2-stage stoch...
متن کاملConvex polynomial approximation
Estimating the degree of approximation in the uniform norm, of a convex function on a finite interval, by convex algebraic polynomials, has received wide attention over the last twenty years. However, while much progress has been made especially in recent years by, among others, the authors of this article, separately and jointly, there have been left some interesting open questions. In this pa...
متن کاملTverberg’s Theorem and Shadows of Simplices and Convex Bodies
Helge Tverberg published more than forty years ago his original proof of the theorem which has been widely acclaimed and today bears his name. This beautiful result has been one of the most celebrated results of discrete geometry and, together with its relatives, still remains a central and one of the most intriguing results of geometric combinatorics. Here we give a reasonably non-technical pr...
متن کاملA Random Polynomial Time Algorithm for Well-rounding Convex Bodies
We present a random polynomial time algorithm for well-rounding convex bodies K in the following sense: Given K G R” and E > 0, the algorithm, with probability at least 1 E, computes two simplices A* and A**, where A** is the blow up of A* from its center by a factor of n + 3, such that A* E K and vol(K\A**) < E volK. The running time is polynomial in l/t and L, the size of the input K.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2000
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00387-8